On a Conjecture about Trees in Graphs with Large Girth
نویسنده
چکیده
The girth of a graph G is the length of a shortest cycle in G. Dobson (1994, Ph.D. dissertation, Louisiana State University, Baton Rouge, LA) conjectured that every graph G with girth at least 2t+1 and minimum degree at least k t contains every tree T with k edges whose maximum degree does not exceed the minimum degree of G. The conjecture has been proved for t 3. In this paper, we prove Dobson's conjecture. 2001 Elsevier Science
منابع مشابه
Research Summary and Plans Connectivity of Cages
My research revolves around structural and extremal aspects of Graph Theory, particularly problems involving girth and distance, trees, cycles in graphs, and some variations of Ramsey theory. I have also done some work in generalized graph colorings and graph labellings. My other interests include graph decomposi-tions and packings, perfect graphs, matching theory, hypergraphs and coding theory...
متن کاملDecomposing highly edge-connected graphs into trees of small diameter
The Tree Decomposition Conjecture by Bárat and Thomassen states that for every tree T there exists a natural number k(T ) such that the following holds: If G is a k(T )-edge-connected simple graph with size divisible by the size of T , then G can be edge-decomposed into subgraphs isomorphic to T . The results on modulo k-orientations by Thomassen show that the Tree Decomposition Conjecture hold...
متن کاملThe second geometric-arithmetic index for trees and unicyclic graphs
Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...
متن کاملTree-Thickness and Caterpillar-Thickness under Girth Constraints
We study extremal problems for decomposing a connected n-vertex graph G into trees or into caterpillars. The least size of such a decomposition is the tree thickness θT(G) or caterpillar thickness θC(G). If G has girth g with g ≥ 5, then θT(G) ≤ bn/gc + 1. We conjecture that the bound holds also for g = 4 and prove it when G contains no subdivision of K2,3 with girth 4. For θC, we prove that θC...
متن کاملSecret sharing on large girth graphs
We investigate graph based secret sharing schemes and its information ratio, also called complexity, measuring the maximal amount of information the vertices has to store. It was conjectured that in large girth graphs, where the interaction between far away nodes is restricted to a single path, this ratio is bounded. This conjecture was supported by several result, most notably by a result of C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 83 شماره
صفحات -
تاریخ انتشار 2001